Combining macros and SAT planning

نویسندگان

  • Mauro Vallati
  • Alfonso E. Gerevini
چکیده

Planning based on propositional satisfiability is a powerful approach for computing makespan-optimal plans. However, it is usually slower then heuristic-based sub-optimal approaches. In this work we propose MacroSatPlan; a SatPlan based planner which exploits macros extracted by Macro-FF and uses a predictive model of the optimal solution length that is constructed by WEKA, a commonly used toolkit of machine learning algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refining Incomplete Planning Domain Models Through Plan Traces

Most existing work on learning planning models assumes that the entire model needs to be learned from scratch. A more realistic situation is that the planning agent has an incomplete model which it needs to refine through learning. In this paper we propose and evaluate a method for doing this. Our method takes as input an incomplete model (with missing preconditions and effects in the actions),...

متن کامل

Toward Hierachical Decomposition for Planning in Uncertain Environments

This work addresses the computational complexity of solving large Markov decision processes by partitioning their state spaces into nearly-independent regions. We propose a method for developing partial plans, or macros, over such regions that yields a polynomial number of macros for each region. Each macro represents knowledge about how to achieve one particular sub-goal within its region of i...

متن کامل

The Role of Macros in Tractable Planning over Causal Graphs

The complexity of existing planners is bounded by the length of the resulting plan, a fact that limits planning to domains with relatively short solutions. We present a novel planning algorithm that uses the causal graph of a domain to decompose it into subproblems and stores subproblem plans in memory as macros. In many domains, the resulting plan can be expressed using relatively few macros, ...

متن کامل

Fast Planning with Iterative Macros

Research on macro-operators has a long history in planning and other search applications. There has been a revival of interest in this topic, leading to systems that successfully combine macrooperators with current state-of-the-art planning approaches based on heuristic search. However, research is still necessary to make macros become a standard, widely-used enhancement of search algorithms. T...

متن کامل

On the Online Generation of Effective Macro-Operators

Macro-operator (“macro”, for short) generation is a well-known technique that is used to speed-up the planning process. Most published work on using macros in automated planning relies on an offline learning phase where training plans, that is, solutions of simple problems, are used to generate the macros. However, there might not always be a place to accommodate training. In this paper we prop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010